منابع مشابه
Generic Subgroups of Group Amalgams
For many groups the structure of finitely generated subgroups is generically simple. That is with asymptotic density equal to one a randomly chosen finitely generated subgroup has a particular well-known and easily analyzed structure. For example a result of D. B. A. Epstein says that a finitely generated subgroup of GL(n,R) is generically a free group. We say that a group G has the generic fre...
متن کاملCommensurability and quasi-isometric classification of hyperbolic surface group amalgams
Let CS denote the class of groups isomorphic to the fundamental group of two closed hyperbolic surfaces identified along an essential simple closed curve in each. We construct a bi-Lipschitz map between the universal covers of these spaces equipped with a CAT(−1) metric, proving all groups in CS are quasi-isometric. The class CS has infinitely many abstract commensurability classes, which we ch...
متن کاملBiocompatibility of Dental Amalgams
Objective. The purpose of this review paper is to review the literature regarding the toxicology of mercury from dental amalgam and evaluate current statements on dental amalgam. Materials and Methods. Two key-words "dental amalgam" and "toxicity" were used to search publications on dental amalgam biocompatibility published in peer-reviewed journals written in English. Manual search was also co...
متن کاملThe issue of amalgams.
We developed OligoCalc as a web-accessible, client-based computational engine for reporting DNA and RNA single-stranded and doublestranded properties, including molecular weight, solution concentration, melting temperature, estimated absorbance coefficients, inter-molecular self-complementarity estimation and intramolecular hairpin loop formation. OligoCalc has a familiar ‘calculator’ look and ...
متن کاملAmalgams and χ-Boundedness
A class of graphs is hereditary if it is closed under isomorphism and induced subgraphs. A class G of graphs is χ-bounded if there exists a function f : N → N such that for all graphs G ∈ G, and all induced subgraphs H of G, we have that χ(H) ≤ f(ω(H)). We prove that proper homogeneous sets, clique-cutsets, and amalgams together preserve χ-boundedness. More precisely, we show that if G and G∗ a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1981
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700004913